MINIMAX FILTER FOR STATISTICALLY INDETERMINATE STOCHASTIC DIFFERENTIAL SYSTEM
نویسندگان
چکیده
منابع مشابه
Minimax Filter for Statistically Indeterminate Stochastic Differential System
The linear stochastic differential system with uncertain intensity of noises in dynamics and observations is considered. For this system the minimax filtering procedure is proposed. The filter is optimal in terms of integral criterion. The obtained filtering equations depend on the dual optimization problem solution, which can be obtained by means of provided numerical procedure. The convergenc...
متن کاملApplication of the Kalman-Bucy filter in the stochastic differential equation for the modeling of RL circuit
In this paper, we present an application of the stochastic calculusto the problem of modeling electrical networks. The filtering problem have animportant role in the theory of stochastic differential equations(SDEs). In thisarticle, we present an application of the continuous Kalman-Bucy filter for a RLcircuit. The deterministic model of the circuit is replaced by a stochastic model byadding a ...
متن کاملA Nonmonotone Filter Method for Minimax Problems
In this paper, we propose a modified trust-region filter method algorithm for Minimax problems, which based on the framework of SQP-filter method and associated with the technique of nonmonotone method. We use the SQP subproblem to acquire an attempt step, and use the filter to weigh the effect of the attempt step so as to avoid using penalty function. The algorithm uses the Lagrange function a...
متن کاملStochastic Programming: Minimax Approach
In many applications of stochastic programming there is some uncertainty about the probability distribution P of the random parameters. The incomplete knowledge of the probability distribution can be described by assuming that P belongs to a specified class P of probability distributions. This in turn suggests to use the minimax decision rule. The first results were concerned with stochastic li...
متن کاملMinimax Policies for Adversarial and Stochastic Bandits
We fill in a long open gap in the characterization of the minimax rate for the multi-armed bandit problem. Concretely, we remove an extraneous logarithmic factor in the previously known upper bound and propose a new family of randomized algorithms based on an implicit normalization, as well as a new analysis. We also consider the stochastic case, and prove that an appropriate modification of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2005
ISSN: 1474-6670
DOI: 10.3182/20050703-6-cz-1902.00389